On the Completeness of the Euations for the Kleene Star in Bisimulation
نویسنده
چکیده
A classical result from Redko 20] says that there does not exist a complete nite equational axiomatization for the Kleene star mod-ulo trace equivalence. Fokkink and Zantema 13] showed, by means of a term rewriting analysis, that there does exist a complete nite equational axiomatization for the Kleene star up to strong bisimulation equivalence. This paper presents a simpler and shorter completeness proof. Furthermore , the result is extended to open terms, i.e., to !-completeness. Finally , it is shown that the three equations for the Kleene star are all essential for completeness.
منابع مشابه
On the Completeness of the Equations for the Kleene Star in Bisimulation
A classical result from Redko says that there does not exist a complete nite equational axiomatization for the Kleene star modulo trace equivalence Fokkink and Zantema showed that there does exist a complete nite equational axiom atization for the Kleene star up to strong bisimulation equivalence Their proof is based on a sophisticated term rewriting analysis In this paper we present a much sim...
متن کاملAn Equational Axiomatization for Multi-Exit Iteration
This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multi-exit iteration. Multiexit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 def = P1X2 +Q1...
متن کاملComplete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration
We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of process algebra. To represent the infinite behavior, we consider the prefix iteration extension of a fragment of Milner’s CCS. The prefix iteration operator is a variant on the binary version of the Kleene star operator obtained by restricting the first argument to be an atomic action and allows us to ...
متن کاملAn Axiomatization for the Terminal Cycle
Milner proposed an axiomatization for the Kleene star in basic process algebra in the presence of deadlock and empty process modulo bisimulation equivalence In this paper Milner s axioms are adapted to the terminal cycle x which executes x in nitely many times in a row and it is shown that this axiomatization is complete for the terminal cycle in basic process algebra with deadlock and empty pr...
متن کاملCoinductive Proof Techniques for Language Equivalence
Language equivalence can be checked coinductively by establishing a bisimulation on suitable deterministic automata. We improve and extend this technique with bisimulation-up-to, which is an enhancement of the bisimulation proof method. First, we focus on the regular operations of union, concatenation and Kleene star, and illustrate our method with new proofs of classical results such as Arden’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996